Parsimonious binary-encoding in integer programming
نویسندگان
چکیده
We describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions.
منابع مشابه
DISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملSolving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملPractical Integer-to-Binary Mapping for Quantum Annealers
Recent advancements in quantum annealing hardware and numerous studies in this area suggests that quantum annealers have the potential to be effective in solving unconstrained binary quadratic programming problems. Naturally, one may desire to expand the application domain of these machines to problems with general discrete variables. In this paper, we explore the possibility of employing quant...
متن کاملA Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملFast Integer Programming in Fixed Dimension
It is shown that the optimum of an integer program in fixed dimension with a fixed number of constraints can be computed with O(s) basic arithmetic operations, where s is the binary encoding length of the input. This improves on the quadratic running time of previous algorithms, which are based on Lenstra’s algorithm and binary search. It follows that an integer program in fixed dimension, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Optimization
دوره 2 شماره
صفحات -
تاریخ انتشار 2005